Hierarchies of Place/transition Refinements in Petri Nets

نویسندگان

  • W. M. Zuberek
  • I. Bluemke
چکیده

Place and transition refinements provide a convenient method of structuring complex net models by replacing single elements (places and transitions) at a ‘higher–level’ of abstraction with ‘lower–level’, more detailed, subnets. The concepts of static and dynamic place/transition refinements are introduced. Dynamic refinements do not increase the size of the (refined) model because no ‘expansion’ of the model is performed; instead, only a ‘logical’ association of higher–level elements with lower-level subnets is maintained and used in model analysis. Multiple applications of place/transition refinements results in hierarchical net models. The paper formalizes the concept of hierarchies of refinements in Petri nets and shows simple applications of the hierarchical approach to modeling of manufacturing cells.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coloured Petri Nets Refinements

Coloured Petri nets allow for modelling complex concurrent systems, but the specification of such systems remains a challenging task. Two approaches are generally used to lessen these difficulties: decomposition and refinement. Charles Lakos proposed three kinds of refinements for coloured Petri nets: type refinement, subnet refinement, and node (place or transition) refinement. This paper prop...

متن کامل

Loose Semantics of Petri Nets

In this paper, we propose a new,loose semantics for place/transition nets based on transition systems and generalizing the reachability graph semantics. The loose semantics of a place/transition net reflects all its possible refinements and is given as a category of transition systems with alternative sequences of events over the net. The main result states that each plain morphism between two ...

متن کامل

A Formal Petri Net Based Model for Antivirus Update Agent System

In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...

متن کامل

A Formal Petri Net Based Model for Antivirus Update Agent System

In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...

متن کامل

Place Bisimulation Equivalences for Design of Concurrent Systems

In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones. The relationships of all the equivalence notions are examined, and their preservation by refinements is investigated to find out which of these relations may be used in top-down design. It is demonstrated that the place bisimulation equivalences may...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015